Normal 0-1 Polytopes

نویسندگان

Huy Tài Hà

Kuei-Nuan Lin

چکیده

We study the question of when 0-1 polytopes are normal or, equivalently, having the integer decomposition property. In particular, we shall associate to each 0-1 polytope a labeled hypergraph, and examine the equality between its Ehrhart and polytopal rings via the combinatorial structures of the labeled hypergraph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NP-Completeness of Non-Adjacency Relations on Some 0-1 Polytopes

In this paper, we discuss the adjacency structures of some classes of 0-1 polytopes including knapsack polytopes, set covering polytopes and 0-1 polytopes represented by complete sets of implicants. We show that for each class of 0-1 polytope, non-adjacency test problems are NP-complete. For equality constrained knapsack polytopes, we can solve adjacency test problems in pseudo polynomial time.

متن کامل

Revlex-initial 0/1-polytopes

We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial subsets of 0/1-vectors. These polytopes are special knapsack-polytopes. It turns out that they have remarkable extremal properties. In particular, we use these polytopes in order to prove that the minimum numbers gnfac(d, n) of facets and the minimum average degree gavdeg(d, n) of the graph of a d...

متن کامل

Simple 0/1-Polytopes

For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very di erent within the class of 0/1-polytopes, since every simple 0/1-polytope is the (cartesian) product of some 0/1-simplices (which proves a ...

متن کامل

Revlex-initial 0/1-polytopes

We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n ≤ 2, we consider the 0/1-knapsack polytope given by all 0/1-vectors x = (x1, . . . , xd) such that ∑d−1 i=0 xi2 i is at most n. The revlex-initial 0/1-polytopes have remarkable extremal properties. In particular, they have surprisingly low numbers of facets and...

متن کامل